- labelled graph
- Макаров: помеченный граф
Универсальный англо-русский словарь. Академик.ру. 2011.
labelled graph
Смотреть что такое "labelled graph" в других словарях:
Gain graph — A gain graph is a graph whose edges are labelled invertibly, or orientably, by elements of a group G . This means that, if an edge e in one direction has label g (a group element), then in the other direction it has label g −1. The label function … Wikipedia
Glossary of graph theory — Graph theory is a growing area in mathematical research, and has a large specialized vocabulary. Some authors use the same word with different meanings. Some authors use different words to mean the same thing. This page attempts to keep up with… … Wikipedia
Continuous graph — This article is about sets of vertices and edges (graphs) defined on a continuous space. For graphs of continuous functions, see Continuous function. For connected graphs, see Connectivity (graph theory). A continuous graph is a graph whose set… … Wikipedia
Distance-hereditary graph — A distance hereditary graph. In graph theoretic mathematics, a distance hereditary graph (also called a completely separable graph)[1] is a graph in which the distances in any connected induced subgraph are the same as they are in the original… … Wikipedia
Hypercube graph — The hypercube graph Q4 Vertices 2n Edges 2n−1n … Wikipedia
Molecular graph — In chemical graph theory and in mathematical chemistry, a molecular graph or chemical graph is a representation of the structural formula of a chemical compound in terms of graph theory. A chemical graph is a labeled graph whose vertices… … Wikipedia
Voltage graph — A voltage graph is a graph whose edges are labelled invertibly by elements of a group. It is formally identical to a gain graph, but it is generally used as a concise way to specify another graph called the derived graph of the voltage graph.… … Wikipedia
Rooted graph — In mathematics, and, in particular, in graph theory, a rooted graph is a mathematical graph in which one node is labelled in a special way to distinguish it from the graph s other nodes. This special node is called the root of the graph.The… … Wikipedia
Cause-effect graph — In software testing, a cause effect graph is a directed graph that maps a set of causes to a set of effects. The causes may be thought of as the input to the program, and the effects may be thought of as the output. Usually the graph shows the… … Wikipedia
Meta-Process Modeling — is a type of metamodeling used in software engineering and systems engineering for the analysis and construction of models applicable and useful some predefined problems. Meta process support the effort of creating flexible process models. The… … Wikipedia
Meta-process modeling — Abstraction level for processes.[1] Meta process modeling is a type of metamodeling used in software engineering and systems engineering for the analysis and construction of models applicable and useful to some predefined problems. Meta process… … Wikipedia
